The quadratic stochastic Euclidean bipartite matching problem
نویسندگان
چکیده
We propose a new approach for the study of the quadratic stochastic Euclidean bipartite matching problem between two sets of N points each, N 1. The points are supposed independently randomly generated on a domain Ω ⊂ Rd with a given distribution ρ(x) on Ω. In particular, we derive a general expression for the correlation function and for the average optimal cost of the optimal matching. A previous ansatz for the matching problem on the flat hypertorus is obtained as particular case.
منابع مشابه
A Scaling Hypothesis for the Euclidean Bipartite Matching Problem
We propose a simple yet very predictive form, based on a Poisson's equation, for the functional dependence of the cost from the density of points in the Euclidean bipartite matching problem. This leads, for quadratic costs, to the analytic prediction of the large N limit of the average cost in dimension d = 1,2 and of the subleading correction in higher dimension. A nontrivial scaling exponent,...
متن کاملComplete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of matchings, extended by a binary number indicating whether the matching contains two specific edges. This polytope is associated to the quadratic matching problem with a single linearized quadratic term. We provide a complete irredundant inequality description, which settles a conjecture by Klein (Ph.D. the...
متن کاملA Survey on Algorithms for Euclidean Matching
Let G = (V,E) be a weighted undirected graph with vertex set V , edge set E and a weight function d. Thus, d(u, v) denotes the weight of any edge (u, v) ∈ E. A matching M ⊆ E is a collection of edges such that every node in V is incident to at most one edge in M . The matching is perfect if every node in V is incident to exactly one edge in M . The cost of the matching is given by ∑ (u,v)∈M d(u...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملPolynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
We consider the problem of minimizing a separable convex objective function over the linear space given by system Mx = 0 with M a totally unimodular matrix. In particular, this generalizes the usual minimum linear cost circulation and co-circulation problems in a network, and the problems of determining the Euclidean distance from a point to the perfect bipartite matching polytope and the feasi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015